A Third Order Accurate Fast Marching Method for the Eikonal Equation in Two Dimensions

نویسندگان

  • Shahnawaz Ahmed
  • Stanley Bak
  • Joyce R. McLaughlin
  • Daniel Renzi
چکیده

In this paper, we develop a third order accurate fast marching method for the solution of the eikonal equation in two dimensions. There have been two obstacles to extending the fast marching method to higher orders of accuracy. The first obstacle is that using one-sided difference schemes is unstable for orders of accuracy higher than two. The second obstacle is that the points in the difference stencil are not available when the gradient is closely aligned with the grid. We overcome these obstacles by using a two-dimensional (2D) finite difference approximation to improve stability, and by locally rotating the grid 45 degrees (i.e., using derivatives along the diagonals) to ensure all the points needed in the difference stencil are available. We show that in smooth regions the full difference stencil is used for a suitably small enough grid size and that the difference scheme satisfies the von Neumann stability condition for the linearized eikonal equation. Our method reverts to first order accuracy near caustics without developing oscillations by using a simple switching scheme. The efficiency and high order of the method are demonstrated on a number of 2D test problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast marching algorithm for the factored eikonal equation

The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at ...

متن کامل

3-D traveltime computation using the fast marching method

We present a fast algorithm for solving the eikonal equation in three dimensions, based on the fast marching method. The algorithm is of the order O(N log N), where N is the total number of grid points in the computational domain. The algorithm can be used in any orthogonal coordinate system and globally constructs the solution to the eikonal equation for each point in the coordinate domain. Th...

متن کامل

Convergence of a Generalized Fast-Marching Method for an Eikonal Equation with a Velocity-Changing Sign

We present a new Fast Marching algorithm for an eikonal equation with a velocity changing sign. This first order equation models a front propagation in the normal direction. The algorithm is an extension of the Fast Marching Method in two respects. The first is that the new scheme can deal with a time-dependent velocity and the second is that there is no restriction on its change in sign. We an...

متن کامل

Fast-marching eikonal solver in the tetragonal coordinates

Accurate and efficient traveltime calculation is an important topic in seismic imaging. We present a fast-marching eikonal solver in the tetragonal coordinates (3-D) and trigonal coordinates (2-D), tetragonal (trigonal) fast-marching eikonal solver (TFMES), which can significantly reduce the first-order approximation error without greatly increasing the computational complexity. In the trigonal...

متن کامل

Computational Study of Fast Methods for the Eikonal Equation

A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically less operations than Fast Marching, the latter method is faster than the former for the problems under consideration and for realistic grid sizes. Fully second order generalizations of methods of this type for problems wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2011